Process Algebra Semantics for Queues

Process Algebra Semantics for Queues

An unbounded queue over a finite set of data 1is,,a Q. in -.A defined by an infinite system of guarded equations. The aim of this paper is to show that no finite system of guarded equations is capable of defining Q. This is a revised version of: Process algebra semantics for queues, Mathematical Centre Research Report IW241,, Amst,rdam.,1983.. * present affiliation & correspondence address: of ...

Process Algebra and Structured Operational Semantics Process Algebra and Structured Operational Semantics

Operational Semantics of Reversibility in Process Algebra

Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational semantics. The main difficulty seems to be with the definitions of forward and reverse computation for...

Reduction semantics in Markovian process algebra

Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...

Evaluating fluid semantics for passive stochastic process algebra cooperation

Fluid modelling is a next-generation technique for analysing massive performance models. Passive cooperation is a popular cooperation mechanism frequently used by performance engineers. Therefore having an accurate translation of passive cooperation into a fluid model is of direct practical application. We compare different existing styles of fluid model translation of passive cooperation in a ...